Optimal-size clique transversals in chordal graphs
نویسندگان
چکیده
منابع مشابه
Clique cutsets beyond chordal graphs
Truemper configurations (thetas, pyramids, prisms, and wheels) have played an important role in the study of complex hereditary graph classes (e.g. the class of perfect graphs and the class of even-hole-free graphs), appearing both as excluded configurations, and as configurations around which graphs can be decomposed. In this paper, we study the structure of graphs that contain (as induced sub...
متن کاملClique cycle transversals in distance-hereditary graphs
A cycle-transversal of a graph G is a subset T ⊆ V (G) such that T ∩V (C) 6= ∅ for every cycle C of G. A clique cycle-transversal, or cct for short, is a cycle-transversal which is a clique. Recognizing graphs which admit a cct can be done in polynomial time; however, no structural characterization of such graphs is known. We characterize distancehereditary graphs admitting a cct in terms of fo...
متن کاملOn P4-transversals of chordal graphs
A P4-transversal of a graph G is a set of vertices T which meets every P4 of G. A P4transversal T is called stable if there are no edges in the subgraph of G induced by T . It has been previously shown by Hoàng and Le that it is NP -complete to decide whether a comparability (and hence perfect) graph G has a stable P4-transversal. In the following we show that the problem is NP -complete for ch...
متن کاملClique Graphs of Chordal and Path Graphs
Clique graphs of chordal and path graphs are characterized. A special class of graphs named expanded trees is discussed. It consists of a subclass of disk-Helly graphs. It is shown that the clique graph of every chordal (hence path) graph is an expanded tree. In addition, every expanded tree is the clique graph of some path (hence chordal) graph. Diierent characterizations of expanded trees are...
متن کاملChordal Graphs and Their Clique Graphs
In the rst part of this paper, a new structure for chordal graph is introduced, namely the clique graph. This structure is shown to be optimal with regard to the set of clique trees. The greedy aspect of the recognition algorithms of chordal graphs is studied. A new greedy algorithm that generalizes both Maximal cardinality Search (MCS) and Lexicographic Breadth rst search is presented. The tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2018
ISSN: 0364-9024
DOI: 10.1002/jgt.22362